GVTS: Global Virtual Time Fair Scheduling to Support Strict Fairness on Many Cores
نویسندگان
چکیده
منابع مشابه
Non-clairvoyant Batch Sets Scheduling: Fairness Is Fair Enough
In real systems, such as operating systems, the scheduler is often unaware of the remaining work in each job or of the ability of the job to take advantage of more resources. In this paper, we adopt the setting for non-clairvoyance of [3,2]. Based on the particular case of malleable jobs, it is generally assumed in the literature that “Equi never starves a job since it allocates to every job th...
متن کاملAchieving Application Level Fairness Through Utility-based Wireless Fair Scheduling
The increasing number of wireless data users and the deployment of broadband wireless networks have brought the issue of providing fair channel access to the forefront. Wireless fair scheduling algorithms must deal with unique domainspecific issues such as location-dependent and bursty channel error. In the past, a number of scheduling disciplines have been proposed for approximating fluid fair...
متن کاملTask Scheduling for Many-Cores with S-NUCA Caches
A many-core processor may comprise a large number of processing cores on a single chip. The many-core’s last-level shared cache can potentially be physically distributed alongside the cores in the form of cache banks connected through a Network on Chip (NoC). Static Non-Uniform Cache Access (SNUCA) memory address mapping policy provides a scalable mechanism for providing the cores quick access ...
متن کاملGlobal Real-Time Multi-Core Virtual Machine Scheduling in Xen
Recent years have witnessed two major trends in the development of complex real-time systems. First, to reduce cost and enhance flexibility, multiple systems are sharing common computing platforms via virtualization technology, instead of being deployed separately on physically isolated hosts. Second, with the evolution and integration of hardware, multi-core processors are increasingly being u...
متن کاملCross-layer Packet-dependant OFDM Scheduling Based on Proportional Fairness
This paper assumes each user has more than one queue, derives a new packet-dependant proportional fairness power allocation pattern based on the sum of weight capacity and the packet’s priority in users’ queues, and proposes 4 new cross-layer packet-dependant OFDM scheduling schemes based on proportional fairness for heterogeneous classes of traffic. Scenario 1, scenario 2 and scenario 3 lead r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Parallel and Distributed Systems
سال: 2019
ISSN: 1045-9219,1558-2183,2161-9883
DOI: 10.1109/tpds.2018.2851515